Recoverable Distributed Shared Memory Using the Competitive Update Protocol
نویسندگان
چکیده
In this paper, we propose a recoverable DSM that uses a competitive update protocol. In this update protocol, multiple copies of each page may be maintainedat different nodes. However, it is also possible fora page to exist in only one node, as some copies of the page may be invalidated. We propose an implementation that makes the competitive update protocol recoverable from a single node failure, by guaranteeing that at least two copies of each page exist. The paper presents preliminary evaluation of the recoverable DSM (using simulation). It is shown that the message overhead of making the DSM recoverable is small.
منابع مشابه
A cost model for distributed shared memory using competitive update
This paper presents a new \cost" analysis model for distributed shared memory (DSM) using competitive update protocol. The cost metric of interest here is the overhead of message passing necessary to implement DSM. This approach is based on segment model proposed previously 10, 11]. Input parameter for the cost analysis model proposed here is the probability density function of the number of re...
متن کاملA Recoverable Distributed Shared Memory Integrating Coherence and Recoverability
Large-scale distributed systems are very attractive for the execution of parallel applications requiring a huge computing power. However, their high probability of site failure is unacceptable, especially for long time running applications. In this paper, we address this problem and propose a checkpointing mechanism relying on a recoverable distributed shared memory (DSM). Although most recover...
متن کاملAn Extended Coherence Protocol for Recoverable DSM Systems with Causal Consistency
This paper presents a coherence protocol for recoverable Distributed Shared Memory (DSM) systems with causally consistent read-write objects. It uses independent checkpointing tightly integrated with coherence operations. That integration results in high availability of shared objects and ensures fast restoration of the consistent state of DSM in spite of multiple node failures, introducing lit...
متن کاملUsing the Resizable Working-set Notion for Software Distributed Shared Memory
This paper proposes an adaptive invalidate/update protocol for software distributed shared memory(DSM), which use the working-set notion of a conventional operating system as the criteria for determining whether to update or invalidate. The proposed protocol can adjust the amount of update messages as changing the value of working-set size. The proposed protocol was implemented in CVM[4], a sof...
متن کاملPractical Schemes using Logs for Lightweight Recoverable DSM
In the existing Fault-Tolerant Software Distributed Shared Memory (FT-SDSM) with the message logging, the logs are used only to recover the failed nodes. In our previous work, we have implemented a lightweight logging protocol, called remote logging, on the SDSM for fault tolerance, which incurs low logging overhead with a fast network and a remote memory for back-up data. In this paper, we pro...
متن کامل